TIIS (한국인터넷정보학회)
Current Result Document :
| 한글제목(Korean Title) |
w-Bit Shifting Non-Adjacent Form Conversion |
| 영문제목(English Title) |
w-Bit Shifting Non-Adjacent Form Conversion |
| 저자(Author) |
Doo-Hee Hwang
Yoon-Ho Choi
|
| 원문수록처(Citation) |
VOL 12 NO. 07 PP. 3455 ~ 3474 (2018. 07) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes Hamming weight by removing a stream of non-zero bits from the binary representation of positive integer. Thanks to this strong point, NAF has been used in various applications such as cryptography, packet filtering and so on. In this paper, to improve the NAF conversion speed of the NAFw algorithm, we propose a new NAF conversion algorithm, called w-bit Shifting Non-Adjacent Form(SNAFw), where w is width of scanning window. By skipping some unnecessary bit comparisons, the proposed algorithm improves the NAF conversion speed of the NAFw algorithm. To verify the excellence of the SNAFw algorithm, the NAFw algorithm and the SNAFw algorithm are implemented in the 8-bit microprocessor ATmega128. By measuring CPU cycle counter for the NAF conversion under various input patterns, we show that the SNAF2 algorithm not only increases the NAF conversion speed by 24% on average but also reduces deviation in the NAF conversion time for each input pattern by 36%, compared to the NAF2 algorithm. In addition, we show that SNAFw algorithm is always faster than NAFw algorithm, regardless of the size of w.
|
| 키워드(Keyword) |
signed-digit representation
non-adjacent form
Hamming weight
encoding
public key cryptography
|
| 파일첨부 |
PDF 다운로드
|
